On Bounded Exploration and Bounded Nondeterminism
نویسندگان
چکیده
This report consists of two separate parts, essentially two oversized footnotes to the article “Sequential Abstract State Machines Capture Sequential Algorithms” by Yuri Gurevich. In Chapter I, Yuri Gurevich and Tatiana Yavorskaya present and study a more abstract version of the bounded exploration postulate. In Chapter II, Tatiana Yavorskaya gives a complete form of the characterization, sketched in the original paper, of bounded-choice sequential algorithms.
منابع مشابه
Delay-Bounded Scheduling A Canonical Characterization of Scheduler Nondeterminism
We provide a new characterization of scheduling nondeterminism by allowing deterministic schedulers to delay their next-scheduled task. By limiting the number of delays that an otherwise-deterministic scheduler is allowed, a bounded-exploration of a concurrent program can be done efficiently—by reduction to an equivalent exploration of a sequential program—and robustly—i.e., not dependent on bo...
متن کاملAlternative approaches to obtain t-norms and t-conorms on bounded lattices
Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...
متن کاملOn the generalization of Trapezoid Inequality for functions of two variables with bounded variation and applications
In this paper, a generalization of trapezoid inequality for functions of two independent variables with bounded variation and some applications are given.
متن کاملFUZZY BOUNDED SETS AND TOTALLY FUZZY BOUNDED SETS IN I-TOPOLOGICAL VECTOR SPACES
In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.
متن کاملAlternation and Bounded Concurrency Are Reverse Equivalent
Numerous models of concurrency have been considered in the framework of automata. Among the more interesting concurrency models are classical nondeterminism and pure concur-rency, the two facets of alternation, and the bounded concurrency model. Bounded concurrency was previously considered to be similar to nondeterminism and pure concurrency in the sense of the succinctness of automata augment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006